package com.xzz.finger;

/**
 * @author: hhz
 * @create: 2022-02-16 13:14
 * 剑指 Offer 10- II. 青蛙跳台阶问题
 **/
public class NumWays {
    public static void main(String[] args) {
        System.out.println(numWays(0));
        System.out.println(numWays(7));
        System.out.println(numWays(8));
    }

    public static int numWays(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        if(n>0){
            dp[1] = 1;
            for (int i = 2; i <= n; i++) {
                dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
            }
        }

        return dp[n];
    }
}
